an optimization model for epidemic mitigation and some theoretical and applied generalizations

in this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. the model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. by using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. the formulation of the model is insensitive to the number of edges in a graph and can be used (with complete or local information) to measure the resistance of a network before and after an infectious spreads. also, we propose some related models as generalizations: quarantining problem including resource constraints (time, budget, etc.), maximum rescued nodes-minimum deleted links problem and minimum removed links problem nding a prespecied number of nodes with weakest connections.